Securing Data by Using Tree Traversal Techniques

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hiding Traversal of Tree Structured Data from Untrusted Data Stores

With the increasing use of web services, many new challenges concerning data security are becoming critical. Especially in mobile services, where clients are generally thin in terms of computation power and storage space, a remote server can be outsourced for the computation or can act as a data store. Unfortunately, such a data store may not always be trustworthy and clients with sensitive dat...

متن کامل

Securing Data by Using Cryptography with Steganography

Securing data is a challenging issue in today’s era. Most of the data travel over the internet and it becomes difficult to make data secure. So Cryptography was introduced for making data secure. But alone cryptography cannot provide a better security approach because the scrambled message is still available to the eavesdropper. There arises a need of data hiding. So here we are using a combina...

متن کامل

Merkle Tree Traversal Revisited

We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.

متن کامل

Tree-Traversal Orientation Analysis

This paper presents a profiling-based analysis to determine the traversal orientation of link-based tree data structures. Given the very-high memory-hierarchy latencies in modern computers, once the compiler has identified that a pointer-based data structure represents a tree, it would be useful to determine the predominant orientation of traversal for the tree. Optimizing compilers can impleme...

متن کامل

Parsing As Tree Traversal

This paper presents a unified approach to parsing, in which top-down, bot tomup and left-corner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bo t tom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bo t tom-up and left-corner parsers collapse t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of Science and Engineering Applications

سال: 2020

ISSN: 2319-7560

DOI: 10.7753/ijsea0911.1001